The secure time-dependent vehicle routing problem with uncertain demands
نویسندگان
چکیده
This paper addresses the transportation of valuable goods in which security carriers are interested to optimize operating costs and vehicle routes’ security. In real operations, route planning scheduling normally performed manually based on individual experience. Hereupon, an optimizing approach should be developed target robbery risk reduction distribution network’ operational costs. Facing dangerous nature some considerations play important role, including demand fluctuations traffic congestion urban environment. To handle these issues, we respectively benefit from robust optimization theory considering time-dependent travel speeds with satisfying “first-in-first-out” property. proposes a rich routing problem denoted by secure time windows pickup delivery uncertain demands (S-TD-VRPTWPD-UD). A mathematical formulation efficient solution combining greedy randomized adaptive search procedure (GRASP) iterated local (ILS) minimize predictability plans using integrated index, besides Extensive computational experiments this analyze impact uncertainty speed time-dependency show efficiency GRASP×ILS implementation. The results significant improvements due as well extra cost protecting model against worst-case scenario requests deriving counterpart S-TD-VRPTWPD-UD.
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملVehicle routing problem with uncertain demands: An advanced particle swarm algorithm
Department of Industrial Engineering, Islamic Azad University – Parand Branch, Parand, Iran Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática (ITI), Ciudad Politécnica de la Innovación, Edificio 8G, Acceso B, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022 Valencia, Spain Department of Industrial Engineering, Iran University of Science and Technolog...
متن کاملThe capacitated vehicle routing problem with evidential demands
This paper studies a vehicle routing problem, where vehicles have a limited capacity and customer demands are uncertain and represented by belief functions. More specifically, this problem is formalized using a belief function based extension of the chance-constrained programming approach, which is a classical modeling of stochastic mathematical programs. In addition, it is shown how the optima...
متن کاملHybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The problem is known to have a computational demanding objective function, which could turn to be infeasible when large instances are considered. Fast approximations of the objective function are therefore appealing because they would allow for an extended exploration of the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2021
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2021.105253